Using lexicographic parametric programming for identifying efficient hyperpalnes in DEA
نویسندگان
چکیده مقاله:
This paper investigates a procedure for identifying all efficient hyperplanes of production possibility set (PPS). This procedure is based on a method which recommended by Pekka J. Korhonen[8]. He offered using of lexicographic parametric programming method for recognizing all efficient units in data envelopment analysis (DEA). In this paper we can find efficient hyperplanes, via using the parameterization of the right hand side vector of the envelopment problem of each efficient unit.
منابع مشابه
using lexicographic parametric programming for identifying efficient hyperpalnes in dea
this paper investigates a procedure for identifying all efficient hyperplanes of production possibility set (pps). this procedure is based on a method which recommended by pekka j. korhonen[8]. he offered using of lexicographic parametric programming method for recognizing all efficient units in data envelopment analysis (dea). in this paper we can find efficient hyperplanes, via using the para...
متن کاملUsing lexicographic parametric programming for identifying efficient units in DEA
In this paper, we propose the use of lexicographic parametric programming to recognize efficient units in Data Envelopment Analysis (DEA). By using the parameterization of the rhs vector of the envelopment problem, we obtain the efficiency curve which is traversing through the efficient frontier from unit to unit. The units in the basis with any parameter value are efficient and the unit domina...
متن کاملLexicographic goal programming approach for portfolio optimization
This paper will investigate the optimum portfolio for an investor, taking into account 5 criteria. The mean variance model of portfolio optimization that was introduced by Markowitz includes two objective functions; these two criteria, risk and return do not encompass all of the information about investment; information like annual dividends, S&P star ranking and return in later years which is ...
متن کاملLexicographic identifying codes
An identifying code in a graph is a set of vertices which intersects all the symmetric differences between pairs of neighbourhoods of vertices. Not all graphs have identifying codes; those that do are referred to as twin-free. In this paper, we design an algorithm that finds an identifying code in a twin-free graph on n vertices in O(n) binary operations, and returns a failure if the graph is n...
متن کاملlexicographic goal programming approach for portfolio optimization
this paper will investigate the optimum portfolio for an investor, taking into account 5 criteria. the mean variance model of portfolio optimization that was introduced by markowitz includes two objective functions; these two criteria, risk and return do not encompass all of the information about investment; information like annual dividends, s&p star ranking and return in later years which...
متن کاملRanking efficient DMUs using minimizing distance in DEA
In many applications, ranking of decision making units (DMUs) is a problematic technical task procedure to decision makers in data envelopment analysis (DEA), especially when there are extremely efficient DMUs. In such cases, many DEA models may usually get the same efficiency score for different DMUs. Hence, there is a growing interest in ranking techniques yet. The main purpose of this paper ...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 03 شماره 1
صفحات 211- 229
تاریخ انتشار 2009-10-01
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023